Synchronized reproducing kernel interpolant via multiple wavelet expansion

نویسندگان

  • S. Li
  • W. K. Liu
چکیده

In this paper, a new partition of unity ± the synchronized reproducing kernel (SRK) interpolant ± is derived. It is a class of meshless shape functions that exhibit synchronized convergence phenomenon: the convergence rate of the interpolation error of the higher order derivatives of the shape function can be tuned to be that of the shape function itself. This newly designed synchronized reproducing kernel interpolant is constructed as an series expansion of a scaling function kernel and the associated wavelet functions. These wavelet functions are constructed in a reproducing procedure, simultaneously with the scaling function kernel, by directly enforcing certain orders of vanishing moment conditions. To the authors knowledge, this unique interpolant is the ®rst of its kind to be constructed, and to be used in numerical computations, both in concept and in practice. The new interpolants are in fact a group of special hierarchial meshless bases, and similar counterparts may exist in spline interpolation method, other meshless methods, Galerkin-wavelet method, as well as the ®nite element method. A detailed account of the subject is presented, and the mathematical principle behind the construction procedure is further elaborated. Another important discovery of this study is that the 1st order wavelet together with the scaling function kernel can be used as a weighting function in Petrov-Galerkin procedures to provide a stable numerical computation in some pathological problems. Benchmark problems in advection-diffusion problems, and Stokes ̄ow problem are solved by using the synchronized reproducing kernel interpolant as the weighting function. Reasonably good results have been obtained. This may open the door for designing well behaved Galerkin procedures for numerical computations in various constrained media.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Moving Least Square Reproducing Kernel Method ( III ) : Wavelet Packet & Its

This work is a natural extension of the work done in Part II of this series. A new partition of unity | the synchronized reproducing kernel (SRK) interpolant|is proposed within the framework of moving least square reproducing kernel representation. It is a further development and generalization of the reproducing kernel particle method (RKPM), which demonstrates some superior computational capa...

متن کامل

Reproducing Kernel Hierarchical Partition of Unity, Part I—formulation and Theory

This work is concerned with developing the hierarchical basis for meshless methods. A reproducing kernel hierarchical partition of unity is proposed in the framework of continuous representation as well as its discretized counterpart. To form such hierarchical partition, a class of basic wavelet functions are introduced. Based upon the built-in consistency conditions, the di erential consistenc...

متن کامل

Reproducing kernels of Sobolev spaces via a green kernel approach with differential operators and boundary operators

We introduce a vector differential operator P and a vector boundary operator B to derive a reproducing kernel along with its associated Hilbert space which is shown to be embedded in a classical Sobolev space. This reproducing kernel is a Green kernel of differential operator L := P∗T P with homogeneous or nonhomogeneous boundary conditions given by B, where we ensure that the distributional ad...

متن کامل

Multiscale kernels

This paper reconstructs multivariate functions from scattered data by a new multiscale technique. The reconstruction uses standard methods of interpolation by positive definite reproducing kernels in Hilbert spaces. But it adopts techniques from wavelet theory and shift–invariant spaces to construct a new class of kernels as multiscale superpositions of shifts and scales of a single compactly s...

متن کامل

Moving least-square reproducing kernel methods (I) Methodology and convergence

This paper formulates the moving least-square interpolation scheme in a framework of the so-called moving least-square reproducing kernel (MLSRK) representation. In this study, the procedure of constructing moving least square interpolation function is facilitated by using the notion of reproducing kernel formulation, which, ‘as a generalization of the early discrete approach, establishes a con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998